Slender Classes . Rod Downey And
نویسنده
چکیده
A Π1 class P is called thin if, given a subclass P ′ of P there is a clopen C with P ′ = P ∩C. Cholak, Coles, Downey and Herrmann [7] proved that a Π1 class P is thin if and only if its lattice of subclasses forms a Boolean algebra. Those authors also proved that if this boolean algebra is the free Boolean algebra, then all such think classes are automorphic in the lattice of Π1 classes under inclusion. From this it follows that if the boolean algebra has a finite number n of atoms then the resulting classes are all automorphic. We prove a conjecture of Cholak and Downey [8] by showing that this is the only time the Boolean algebra determines the automorphism type of a thin class.
منابع مشابه
The Analytic Technique and Experimental Research Methods of Post-buckling about Slender Rod Strings in Wellbore
The buckling behavior of rod strings in wellbore is one of the key issues in petroleum engineering. The slender rod strings in vertical wellbore were selected as research objects. Based on the energy method, the critical load formulas of sinusoidal and helical buckling were derived for the string with the bottom of the wellbore pressure. According to the sinusoidal and helical buckling’s geomet...
متن کاملRod Downey and Antonio Montalbán
This theorem will be used in both constructions, the one of a non-slender thin class, and the one of a slender thin class. The proof starts developing ideas the will be used in both of those constructions. In the case when [T ] is perfect, we will define two tree-embeddings f, r : 2 → S satisfying that for every σ ∈ 2, (fr1) f(σ) ⊆ r(σ), f(σ0) = r(σ)0, f(σ1) = r(σ)1, and (fr2) [Sf(σ)] = [Sr(σ)]...
متن کاملSchnorr trivial sets and truth-table reducibility
We give several characterizations of Schnorr trivial sets, including a new lowness notion for Schnorr triviality based on truth-table reducibility. These characterizations allow us to see not only that some natural classes of sets, including maximal sets, are composed entirely of Schnorr trivials, but also that the Schnorr trivial sets form an ideal in the truth-table degrees but not the weak t...
متن کاملOn the Turing Degrees of Divergence Bounded Computable Reals
The d-c.e. (difference of c.e.) and dbc (divergence bounded computable) reals are two important subclasses of ∆2-reals which have very interesting computability-theoretical as well as very nice analytical properties. Recently, Downey, Wu and Zheng [2] have shown by a double witness technique that not every ∆2-Turing degree contains a d-c.e. real. In this paper we show that the classes of Turing...
متن کاملOn Π] Classes and their Ranked Points
We answer a question of Cenzer and Smith by constructing a nonzero degree each of whose members is a rank one point of a Π? class. The technique of proof is a rather unusual full approximation argument. This method would seem to have other applications.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006